PSEUDO-FINITE SETS, PSEUDO-O-MINIMALITY

On Minimality in Pseudo-bci-algebras

In this paper we consider pseudo-BCK/BCI-algebras. In particular, we consider properties of minimal elements (x ≤ a implies x = a) in terms of the binary relation ≤ which is reflexive and antisymmetric along with several more complicated conditions. Some of the properties of minimal elements obtained bear resemblance to properties of B-algebras in case the algebraic operations ∗ and ◦ are ident...

Pseudo-finite model theory

We consider the restriction of first–order logic to models, called pseudo– finite, with the property that every first–order sentence true in the model is true in a finite model. We argue that this is a good framework for studying first-order logic on finite structures. We prove a Lindström Theorem for extensions of first order logic on pseudo-finite structures.

Pseudo-Finite Model Theory

Einstein Metrics, Symplectic Minimality, and Pseudo-Holomorphic Curves

Let (M4, g, ω) be a compact, almost-Kähler Einstein manifold of negative star-scalar curvature. Then (M,ω) is a minimal symplectic 4-manifold of general type. In particular, M cannot be differentiably decomposed as a connected sum N#CP2.

Pseudo-Finite Homogeneity and Saturation

When analyzing database query languages a property of theories, the pseudo-finite homogeneity property has been introduced and applied (cf. [3]). We show that a stable theory has the pseudo-finite homogeneity property just in case its expressive power for finite states is bounded. Moreover, we introduce the corresponding pseudo-finite saturation property and show that a theory fails to have the...